Optimized refinable enclosures of multivariate polynomial pieces

نویسندگان

  • David Lutterkort
  • Jörg Peters
چکیده

An enclosure is a two-sided approximation of a unior multivariate function by a pair of typically simpler functions such that over the domain of interest. Enclosures are optimized by minimizing the width and refined by enlarging the space . This paper develops a framework for efficiently computing enclosures for multivariate polynomials and, in particular, derives piecewise bilinear enclosures for bivariate polynomials in tensor-product Bézier form. Runtime computation of enclosures consists of looking up dim pre-optimized enclosures and linearly combining them with the second differences of . The width of these enclosures scales by a factor 1/4 under midpoint subdivision.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimized Refinable Surface Enclosures

An enclosure of a composite spline surface is a pair of simpler approximations that sandwich the surface. In particular, we are interested in efficiently constructing two triangulations, so that matched triangle pairs enclose a piece of the curved surface. The width of the enclosure, i,e. the distance between inner and outer hull, can be easily measured, because it is taken on at a vertex. Encl...

متن کامل

Wavelet Bi-frames with few Generators from Multivariate Refinable Functions

Using results on syzygy modules over a multivariate polynomial ring, we are able to construct compactly supported wavelet bi-frames with few generators from almost any pair of compactly supported multivariate refinable functions. In our examples, we focus on wavelet bi-frames whose primal and dual wavelets are both derived from one box spline function. Our wavelet bi-frames have fewer generator...

متن کامل

The Minimal Degree of Solutions to Polynomial Equations Used for the Construction of Refinable Functions

Refinable functions, whose integer shifts interpolate the integer grid, provide favorable sampling formulas. Solutions to polynomial equations have been used in literature to construct such desirable refinable functions in the uniand multivariate setting. Polynomial solutions with minimal total and minimal maximum degree are seeked since the degree induces an upper bound on the size of the refi...

متن کامل

Multivariate Refinable Functions of High Approximation Order Via Quotient Ideals of Laurent Polynomials

We give an algebraic interpretation of the well–known “zero–condition” or “sum rule” for multivariate refinable functions with respect to an arbitrary scaling matrix. The main result is a characterization of these properties in terms of containment in a quotient ideal, however not in the ring of polynomials but in the ring of Laurent polynomials.

متن کامل

Analysis of Optimal Bivariate Symmetric Refinable Hermite Interpolants

Multivariate refinable Hermite interpolants with high smoothness and small support are of interest in CAGD and numerical algorithms. In this article, we are particularly interested in analyzing some univariate and bivariate symmetric refinable Hermite interpolants, which have some desirable properties such as short support, optimal smoothness and spline property. We shall study the projection m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Computer Aided Geometric Design

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2001